Random generations of the countable random graph
نویسندگان
چکیده
منابع مشابه
Random generations of the countable random graph
We consider random processes more general than those considered by Erdös and Rényi for generating the countable random graph. It is proved that, in the category sense, almost all random processes we consider generate the countable random graph with probability 1. Under a weak boundedness assumption we give a criterion for the random processes which generate the countable random graph almost sur...
متن کاملThere is no universal countable random-free graph
We consider embeddings between infinite graphs. In particular, We establish that there is no universal element in the class of countable graphs into which the random graph is not embeddable.
متن کاملStationary countable dense random sets
We study the probability theory of countable dense random subsets of (uncountably infinite) Polish spaces. It is shown that if such a set is stationary with respect to a transitive (locally compact) group of symmetries then any event which concerns the random set itself (rather than accidental details of its construction) must have probability zero or one. Indeed the result requires only quasi-...
متن کاملAll countable monoids embed into the monoid of the infinite random graph
We prove that the full transformation monoid on a countably infinite set is isomorphic to a submonoid of End(R), the endomorphism monoid of the infinite random graph R. Consequently, End(R) embeds each countable monoid, satisfies no nontrivial monoid identity, and has an undecidable universal theory.
متن کاملAll Countable Monoids Embed in the Monoid of the Infinite Random Graph
We prove that the endomorphism monoid of the infinite random graph R contains as a submonoid an isomorphic copy of each countable monoid. As a corollary, the monoid of R does not satisfy any non-trivial semigroup identity. We also prove that the full transformation monoid on a countably infinite set is isomorphic to a submonoid of the monoid of R.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2006
ISSN: 0168-0072
DOI: 10.1016/j.apal.2005.12.016